ETP-Mine: An Efficient Method for Mining Transitional Patterns

نویسنده

  • B. Kiran Kumar
چکیده

A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior of frequent patterns in a transaction database. To discover transitional patterns and their significant milestones, first we have to extract all frequent patterns and their supports using any frequent pattern generation algorithm. These frequent patterns are used in the generation of transitional patterns. The existing algorithm (TP-Mine) generates frequent patterns, some of which cannot be used in generation of transitional patterns. In this paper, we propose a modification to the existing algorithm, which prunes the candidate items to be used in the generation of frequent patterns. This method drastically reduces the number of frequent patterns which are used in discovering transitional patterns. Extensive simulation test is done to evaluate the proposed method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New and Efficient Method for the Adsorption and Separation of Arsenic Metal Ion from Mining Waste Waters of Zarshouran Gold Mine by Magnetic Solid-Phase Extraction with Modified Magnetic Nanoparticles

Widespread arsenic contamination of mining wastewater of Zarshouran (West Azerbaijan province) has led to a massive epidemic of arsenic poisoning in the whole of surrounding areas. It is estimated that approximately all agriculture fields are being irrigated with the water that its arsenic concentrations elevated above the World Health Organization’s standard of 10 parts per billion. A novel ad...

متن کامل

An Efficient Approach for Mining Fault-Tolerant Frequent Patterns Based on Bit Vector Representations

In this paper, an algorithm, called VB-FT-Mine (Vectors-Based Fault–Tolerant frequent patterns Mining), is proposed for mining fault-tolerant frequent patterns efficiently. In this approach, fault–tolerant appearing vectors are designed to represent the distribution that the candidate patterns contained in data sets with fault-tolerance. VB-FT-Mine algorithm applies depth-first pattern growing ...

متن کامل

Parallel Regular-Frequent Pattern Mining in Large Databases

Mining interesting patterns in various domains is an important area in data mining and knowledge discovery process. A number of parallel and distributed frequent pattern mining algorithms have been proposed so far for the large and/or distributed databases. Occurrence frequency is not the only criteria to mine the patterns but also occurrence behavior (regularity) of a pattern may also be inclu...

متن کامل

GTRACE-RS: Efficient Graph Sequence Mining using Reverse Search

The mining of frequent subgraphs from labeled graph data has been studied extensively. Furthermore, much attention has recently been paid to frequent pattern mining from graph sequences. A method, called GTRACE, has been proposed to mine frequent patterns from graph sequences under the assumption that changes in graphs are gradual. Although GTRACE mines the frequent patterns efficiently, it sti...

متن کامل

Estimation of reliability-based maintenance time intervals of Load-Haul-Dumper in an underground coal mine

Reliability estimation plays a significant role in the performance assessment of mining equipment, and aids in designing efficient and effective preventive maintenance strategies. Continuous and random/irregular occurrence of failures in a system could be the main cause for performance drop of machinery. The accomplishment of a projected level of production is possible only by an efficient oper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1009.0971  شماره 

صفحات  -

تاریخ انتشار 2010